随机环境中分枝q-过程

引进了机环境中一致马氏过程,随机分枝q-矩阵和随机环境中分枝q-过程.给了随机环境中分枝q-过程存在性和唯一性的充分条件.最后证明了任意随机分枝转移密度矩阵都是零流入的.     

Synthesis and Rheological Investigation ofModel Symmetric 3-Arm Star Polyethylene简

A variety of linear and 3-arm star polyethylene （PE） model polymers covering a wide range of molecular weight are synthesized by the living polymerization of butadiene and the subsequent hydrogenation. Several rheological parameters of these model linear and 3-arm star PE samples are analyzed for detecting the long chain branching （LCB） structure. It is found that the analyses based on zero shear viscosity, vGP plot and flow activation energy are very sensitive to the 3-arm star PEs. The information on the presence of LCB can be obtained with these methods even for low molecular weight samples, which can not be determined by GPC-MALLS. However the information about the LCB structure can not be obtained by the rheological methods alone.     

随机环境中多物种分枝随机游动

引进了随机环境中多物种分枝随机游动的一般模型.在分枝过程非灭绝的情况下,讨论了系统的状态分类,得到了系统暂留及强常返的充要条件是存在k个定义在整数集上的函数分别满足某种性质.最后给出了系统强暂留的充分条件.     

Growth of Lévy trees

We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of a Poisson sampling directed by the mass measure. T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries, EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779.     

随机环境中分枝过程的等价定理

给定了随机环境中分枝过程(BPRE)的精确定义,讨论了有关的可测性问题和BPRE的基本性质．在此基础上,证明了BPRE的一个等价定理．     

QCD因子化在湮没衰变_(s,d)~0→J/ψγ中的应用

在QCD因子化框架下 ,对可能的辐射湮灭衰变 B0s ,d→J/ψγ进行研究 .在标准模型中 ,相对于简单因子化下领头阶的分支比 ,αs 阶非因子化辐射修正对分支比有显著的量级上的改变 ,这些衰变可用来检验因子化方法 .在理论上 ,B介子稀有辐射衰变对超出标准模型的新物理特别敏感 .作为一个例子 ,我们考虑右手带电流对标准模型中左手流可能的混合效应 ,这个混合对衰变分支比有显著的影响 .     

Configurational Effects in Statistical Theory of Branched Non-Random Polycondensation

The statistical theory of gelation in the simplest process of the non-random polycondensation (S. I. Kuchanov, T. V. Zharnikov, J. Stat. Phys., 111(5/6), 1273 (2003)) has been refined as to be able to take into account the effect of a monomer configuration on topological characteristics of the polymer network of the gel. Proceeding from the kinetic analysis of such a polycondensation, we rigorously prove that it can be described in terms of some stochastic branching process. The parameters of the process depend on the overall number of functional groups in the monomer as well as on the pattern of their mutual arrangement. Examples of some model systems illustrate the effect of kinetic and configurational factors on the topology of a polymer network formed in the course of non-random polycondensation.     

The Computable Dimension of I-Trees of Infinite Height

We study computable trees with distinguished initial subtree (briefly, I-trees). It is proved that all I-trees of infinite height are computably categorical, and moreover, they all have effectively infinite computable dimension.     

Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions

Two algorithms for finding a global minimum of the product of two affine fractional functions over a compact convex set and solving linear fractional programs with an additional constraint defined by the product of two affine fractional functions are proposed. The algorithms are based on branch and bound techniques using an adaptive branching operation which takes place in one-dimensional intervals. Results from numerical experiments show that large scale problems can be efficiently solved by the proposed methods.